Systems and methods for providing network-based permissioning using security node hash identifiers

ABSTRACT

Systems and methods generate a first security node hash identifier by performing a first hash operation, such as a one-way hash, on a first data resource identifier associated with a first data resource, such as a data set, produced by a data resource platform. The systems and methods generate a dependent second security node hash identifier by performing a second hash operation on a second data resource identifier associated with a dependent second data resource produced by the data resource platform and on the first security node hash identifier, receive an access request for access to the dependent second data resource; and in response to the access request, grant permission to access the dependent second data resource to a user associated with the access request based on the dependent second security node hash identifier.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No.17/582,139, filed Jan. 24, 2022, which is a continuation of U.S.application Ser. No. 16/733,415 (now U.S. Pat. No. 11,263,336), filedJan. 3, 2020, which claims priority to U.S. Provisional Application No.62/927,218, filed Oct. 29, 2019, incorporated by reference herein forall purposes.

BACKGROUND

Certain embodiments of the present disclosure are directed to userpermissioning systems. More particularly, some embodiments of thepresent disclosure provide systems and methods for providingnetworked-based permissioning for a data resource platform.

Typical computer systems include a file system to control how data isstored and retrieved. Conventional file systems maintain informationregarding user access permission in conjunction with each storedresource to control users' ability to access the resources. For example,one user may be permitted to view and change a particular resource whileanother user may only be permitted to view the resource. In someinstances, multiple application programs may share common access toresources included in a single file system. For example, a suite ofnetwork applications may provide a common interface that provides a userwith various related functionalities that allow the user to interactwith a common repository of data objects shared by the applicationsuite. In these instances, each application program is typicallyresponsible for evaluating whether a user has permission to access aresource included in the file system based on the user access permissioninformation maintained along with the resource. Not only does thisconventional implementation lead to painstaking redundancies indevelopment of such an application, but this also presents the potentialfor inconsistent handling of user access permissions across each of theapplications.

Network-based permissioning systems can serve as a centralizedpermissioning system for data processing platforms to evaluate accesspermissions of users of the network system with respect to resources,such as raw data and/or data sets derived from the raw data, stored inone or more data resource databases. Some network-based permissioningsystems maintain a data structure representing a data resource'shierarchy in the form of a hierarchy resource graph of nodes that isupdated to reflect new or updated permission policies. Each node in theresource graph represents data resources, such as data sets. Thehierarchy resource graph represents an inheritance chain of dataresources. An effective permission policy is maintained for each dataresource because a data object, also referred to as a policy objectrepresenting the policy, includes individual policy information for eachnode of the entire hierarchical tree such that the policy objectcontains all information that is needed to determine a user's accesspermission with respect to a particular data resource.

However, as more and more transforms (e.g., transactions) are used toproduce dependent data sets, the number of nodes in the hierarchicalresource graph can increase to hundreds of thousands of nodes requiringevaluation of permissions associated with many nodes. This results ininefficient security access to data sets or other resources andincreased processing by the network-based permissioning systems.

Hence it is highly desirable to improve the technique for providingnetwork-based user permissioning for access to resources.

SUMMARY

Certain embodiments of the present disclosure are directed to userpermissioning systems. More particularly, some embodiments of thepresent disclosure provide systems and methods for providingnetworked-based permissioning for a data resource platform usinghash-based security node hash identifiers.

According to some embodiments, a system generates a first security nodehash identifier by performing a first hash operation, such as a one-wayhash, on a first data resource identifier associated with a first dataresource, such as a data set, produced by a data resource platform. Incertain embodiments, the system generates a dependent second securitynode hash identifier by performing a second hash operation on a seconddata resource identifier associated with a dependent second dataresource produced by the data resource platform and on the firstsecurity node hash identifier, receives an access request for access tothe dependent second data resource; and in response to the accessrequest, grants permission to access the dependent second data resourceto a user associated with the access request based on the dependentsecond security node hash identifier.

According to some embodiments, a method for providing network-basedpermissioning for a data resource platform includes generating a firstsecurity node hash identifier by performing a first hash operation, suchas a one-way hash operation, on at least a first data resourceidentifier, such as a container identifier, associated with a first dataresource, such as a data set, produced by the data resource platform.The method includes generating a dependent second security node hashidentifier by performing a second hash operation on a second dataresource identifier associated with a dependent second data resource andon at least the first security node hash identifier, the dependentsecond data resource being produced by the data resource platform usingat least the first data resource as at least one parent data resource.The method includes receiving an access request for access to thedependent second data resource and in response to the access request,granting permission to access the dependent second data resource to auser associated with the access request based at least in part on thedependent second security node hash identifier. The method is performedby one or more processors.

According to certain embodiments, a non-transitory machine-readablemedium includes executable instructions that when executed by one ormore processors cause the one or more processors to generate a firstsecurity node hash identifier by performing a first hash operation on atleast a first data resource identifier associated with a first dataresource produced by the data resource platform and generating adependent second security node hash identifier by performing a secondhash operation on a second data resource identifier associated with adependent second data resource and on at least the first security nodehash identifier, the dependent second data resource being produced bythe data resource platform using at least the first data resource as atleast one parent data resource. The non-transitory machine-readablemedium includes executable instructions that when executed by one ormore processors cause the one or more processors to receive an accessrequest for access to the dependent second data resource and in responseto the access request, grant permission to access the dependent seconddata resource to a user associated with the access request, based atleast in part on the dependent second security node hash identifier.

Depending upon the embodiment, one or more benefits may be achieved.These benefits and various additional benefits can be fully appreciatedwith reference to the detailed description and accompanying drawingsthat follow.

BRIEF DESCRIPTION OF THE DRAWINGS

The implementations will be more readily understood in view of thefollowing description when accompanied by the below figures, whereinlike reference numerals represent like elements, and wherein:

FIG. 1 is a network diagram depicting a network system including a groupof application servers in communication with a network-basedpermissioning system configured for evaluating access rights for dataresources commonly accessed by the group of application servers,according to an example embodiment;

FIG. 2 is a diagram illustrating one example of generating security nodehash identifiers using a security node hash generator according to anexample set forth in the disclosure;

FIG. 3 is a flowchart illustrating a method for providing network-basedpermissioning using security node hash identifiers in accordance withone example set forth in the disclosure;

FIG. 4 is a block diagram illustrating various components of thenetwork-based permissioning system which is provided as part of anetwork system, in accordance with some examples set forth in thedisclosure;

FIG. 5 is a flowchart illustrating a method for providing network-basedpermissioning using security node hash identifiers in accordance with anexample set forth in the disclosure; and

FIG. 6 is a diagrammatic representation of a machine in the example forma computer system within which a set of instructions for causing themachine to perform any one or more of the methodologies discussed hereinmay be executed.

DETAILED DESCRIPTION

Example embodiments relate to a network-based permissioning system andmethods for managing access permissions associated with data resources.A “data resource” as used herein may include any item of data or code(e.g., a data object, data set, resource locator) that can be used byone or more computer programs. In example embodiments, data resourcesare stored in one or more network databases and are capable of beingaccessed by applications hosted by servers that share common access to anetwork database. In some embodiments, a network-based permissioningsystem employs a more compact hierarchy resource graph that includessecurity nodes, that have security node hash identifiers, that aggregatecommon security across many transactions (e.g., transactions thatproduce data sets).

In some embodiments, benefits include significant improvements,including for example, a decrease in response time by the computingplatform to provide access to data resources. In certain embodimentsdecreased processor usage can occur compared to prior systems which canresult in reduced system degradation and improved power savings. In someembodiments increased network communication efficiency can result alongwith other technical benefits. In some implementations, each securitynode (e.g., security node hash identifier) summarizes the security of aparticular data resource. In some examples, a stored security node graphrepresentation does not grow with every transaction or group oftransactions that result in a new data set. In some examples, the storedsecurity node graph is similar to a hash-tree/Merkle-tree and eachsecurity node is uniquely defined by its hash value.

In certain embodiments, one or more solutions rooted in computertechnology overcome one or more problems specifically arising in therealm of computer technology. Some embodiments are directed to computingplatforms that include workspace servers that provide access toapplications to client devices through a browser-based user interface.Some embodiments are directed to computing platforms including hosts andnetworking devices. In some examples, the computing platforms includevirtual servers or virtual machines. In certain examples, the computingplatforms include a virtual computing environment that provides anoperating system and/or an application server for running one or morecontainers. For example, a container includes a containerizedapplication. In some examples, one or more containers run on a server orhost machine of the computing platform and are associated withparticular resources that include CPU, memory, storage, and/ornetworking capacity.

FIG. 1 is a network diagram depicting a network system 100 including adata processing platform 102 in communication with a network-basedpermissioning system 104 configured for registering and evaluatingaccess permissions for data resources to which the group of applicationservers 106-108 share common access, according to an example embodiment.Consistent with some embodiments, the network system 100 may employ aclient-server architecture, though the present inventive subject matteris, of course, not limited to such an architecture, and could equallywell find application in an event-driven, distributed, or peer-to-peerarchitecture system, for example. Moreover, it shall be appreciated thatalthough the various functional components of the network system 100 arediscussed in the singular sense, multiple instances of one or more ofthe various functional components may be employed.

The data processing platform 102 includes a group ofservers—specifically, servers 106-108, which host network applications109-111, respectively. The network applications 109-111 hosted by thedata processing platform 102 may collectively compose an applicationsuite that provides users of the network system 100 with a set ofrelated, although independent, functionalities that are accessible by acommon interface. For example, the network applications 109-111 maycompose a suite of software application tools that can be used toanalyze data to develop various insights about the data, and visualizevarious metrics associated with the data. To further this example, thenetwork application 109 may be used to analyze data to developparticular metrics with respect to information included therein, whilethe network application 110 may be used to render graphicalrepresentations of such metrics. It shall be appreciated that althoughFIG. 1 illustrates the data processing platform 102 as including aparticular number of servers, the subject matter disclosed herein is notlimited to any particular number of servers and in other embodiments,fewer or additional servers and applications may be included.

Each of the servers 106-108 are in communication with the network-basedpermissioning system 104 over a network 112 (e.g. the Internet or anintranet). Each of the servers 106-108 are further shown to be incommunication with a database server 114 that facilitates access to aresource database 116 over the network 112, though in other embodiments,the servers 106-108 may access the resource database 116 directly,without the need for a database server 114. The resource database 116stores data resources that may be used by any one of the applications109-111 hosted by the data processing platform 102.

To access data resources from the resource database 116, the servers106-108 transmit access requests via the network 112 to thenetwork-based permissioning system 104. An access request includes adata resource identifier and a user identifier corresponding to a user(also referred to herein as a “requesting user”) who is utilizing one ofthe applications 109-111 to access to the data resource (also referredto herein as a “requesting application”). The network-basedpermissioning system 104 may include an application programminginterface (API) or other machine interface to receive such accessrequests from the server 106-108 hosting the requesting application109-111.

In some implementations, the network-based permissioning system 104 usesa cryptographic hash operation to generate security node hashidentifiers that represent a combination of approved security levels fordependent security permissions across dependent data sets (e.g., dataresources in the hierarchical resource graph) and the security node hashidentifiers are linked to effective security policies associated with adata set. In certain implementations, security nodes are placed in nodehierarchy graphs wherein the security nodes aggregate common securityacross many transactions through a hash tree mechanism and forpermission purposes, the network-based permissioning system 104 useshash-based security node hash identifiers to determine whether a userhas the requested permission. In some implementations, a containerresource identifier, such as a data set ID, is employed and all otherresources under that container share the same security node if and onlyif they share the same dependencies. In certain implementations, thenetworked based permissioning system 104 serves as a centralizedpermissioning system for the data processing platform 102 to evaluateaccess permissions of users of the network system 100 with respect todata resource stored in the resource database 116 or elsewhere. In thisway, the network-based permissioning system 104 obviates the need forthe network applications 109-111 to have distinct dedicatedpermissioning systems. As a result, the network applications 109-111 canoperate and function independently from one another while maintainingconsistency with respect to user's access permissions of shared dataresources.

As shown, the network system 100 also includes a client device 118 incommunication with the data processing platform 102 and thenetwork-based permissioning system 104 over the network 106. The clientdevice 118 communicates and exchanges data with the data processingplatform 102

The client device 118 may be any of a variety of types of devices thatinclude at least a display, a processor, and communication capabilitiesthat provide access to the network 106 (e.g., a smart phone, a tabletcomputer, a personal digital assistant (PDA), a personal navigationdevice (PND), a handheld computer, a desktop computer, a laptop ornetbook, or a wearable computing device), and may be operated by a user(e.g., a person) to exchange data with other components of the networksystem 100 that pertains to various functions and aspects associatedwith the network system 100 and its users. The data exchanged betweenthe client device 118 and the data processing platform 102 involveuser-selected functions available through one or more user interfaces(UIs). The UIs may be specifically associated with a web client (e.g., abrowser) or an application 109-111 executing on the client device 118that is in communication with the data processing platform 102. Forexample, the network-based permissioning system 104 provides userinterfaces to a user of the client device 118 (e.g., by communicating aset of computer-readable instructions to the client device 118 thatcause the client device 118 to display the user interfaces) that allowthe user to register policies associated with data resources stored inthe resource database 116.

According to some embodiments, the data processing platform 102 includesa container-orchestration platform. In some examples, thecontainer-orchestration platform allows for automated deployment,scaling and/or operations of containers across the platform. Forexample, the container-orchestration platform employs the containersacross one or more instances of the computing platform 103.

According to certain embodiments, a container of the data processingplatform 102 includes one or more applications. In some examples, thecontainer also includes data and libraries associated with the one ormore applications. For example, the container allows the one and moreapplications and their associated data and libraries to be co-located onthe same server or host machine. In one example, the container allowsthe one and more applications and their associated data and libraries toshare resources. For example, the shared resources include CPU, memory,storage, and/or networking capacity. As an example, the containerrepresents the lowest level of a micro-service of the data processingplatform 102. In one example, the micro-service includes the one or moreapplications, libraries and the applications' dependencies.

FIG. 2 illustrates an embodiment of the network-based permissioningsystem 104 that in this example, provides cryptographic hashescorresponding to security nodes (e.g., also referred to as permissionnodes) in a resource node hierarchy. In some implementations, users areprovided permission to dependent data sets (e.g., dependent nodes in theresource node hierarchy) only if they have permission to the original orparent data set (e.g., root node in the hierarchy). In someimplementations, the policy for a root node for a particular user ismaintained through linking to a security node hash ID generated fromdependent nodes. In some implementations, the policy for dependent nodesis inherited from the root nodes from which the dependent nodes arederived.

As illustrated in the example of FIG. 2 , a plurality of containers202-208 (e.g., corresponding to nodes in a resource node tree) aredesignated by differing data resource identifiers 210-216, such ascontainer resource identifiers or other identifiers also referred to inthis example as data set identifiers as applied to data sets. Eachcontainer 202-208 includes unique transaction identifiers 218 a-218 h(also referred to as transactions) and resulting files (e.g., resourcelocators) containing data from data resources in the data resourceplatform that have been analyzed or generated through transformoperations or other operations resulting in a data set for which usersare granted permission to perform various operations on. In thisexample, a security node hash generator 220 generates for eachtransaction or group of transactions, a security node hash identifier(ID) 222 a-222 f which includes performing in one example, a one-wayhash operation using a cryptographic hash engine 224 on the dataresource IDs 210-216 (e.g., DATA SET A ID, DATA SET B ID, DATA SET C IDAND DATA SET D ID) and any dependent security node hash identifiers asdescribed below.

In an example a transaction is a writing of data to another data set.Where each transaction (e.g., resource locator), or group oftransactions, has a security node, the process works as follows. A rawdata set identified by data resource ID 210 (e.g., DATA SET ID A, theparent container ID) with no dependencies, and a transaction(s), such astransactions TXN1 218 a and TXN2 218 b under it will have a securitynode with a security node hash ID 222 a (SN1) that consists of just thehash of the data resource identifier 210, DATA SET A ID. In other words,the security of each of those transactions is the same as the data setit belongs under. A derived (e.g., dependent) data set (e.g., a childcontainer), such as one derived through one or more transform operations226 a, is shown as having data resource identifier 212, DATA SET B ID(e.g., generated via transactions 218 c and 218 d) which has adependency on the raw data set, DATA SET A ID in container 202, willhave a security node hash ID 222 b (SN2) that consists of a hash of thederived data set container resource identifier 212 and the security nodehash ID 222 a of the raw data set. In other words, a user will not bedenied access if that user also has access to the raw data set and thederived data set. If another transaction, for example transaction TXN7218 g, on the derived data set DATA SET B ID, is based on a transactionTXN6 from a different parent container 208 (e.g., different data set216, DATA SET D ID) then the generated security node hash ID 222 e willbe different from the security node hash ID 222 b for the derived dataset. As such, the creation of a new security node hash ID 222 e occurs.In some examples the security node hash identifiers 222 a-222 f areconfigured as a permissioning hash tree in memory.

In certain examples, transaction identifiers 218 a-218 h in data setsare used to look up corresponding security node hash identifiers and thesecurity node hash identifiers 222 a-222 f are used to look upcorresponding security policies for the user access request. In someexamples, data sets are organized in containers, in other examples,containers are not used. In certain examples, hash values are producedby performing a cryptographic one-way hash operation on a concatenationof a data set identifier and security node hash identifiers of alldirectly dependent security nodes. In one example, the security nodehash identifiers embed the policy inheritance chain from parent dataresources and dependent data resources.

Other examples of dependencies and the generation of correspondingsecurity node hash identifiers is also illustrated in FIG. 2 . Forexample, container 206 is shown as being dependent on container 204 suchthat a data set represented by DATA SET C ID 214 is dependent on thedata set represented by DATA SET B ID 212 via a transform operationshown as 226 b. Container 208 is shown to be a parent or root containerhaving a raw DATA SET D ID 216 which is generated using TXN6 218 f Thedata set identified by the DATA SET D ID 216 is used as input for thetransaction TXN7 218 g such that the transaction TXN7 218 g generates adata set, for example, that depends on the data set of container 208 andcontainer 204 and because container 204 is dependent on container 208,the security node hash identifier SN2′ is generated by taking the hashof the DATA SET B ID 212 concatenated with the security node hashidentifier 222 a and 222 d as represented by SN2′(TXN7)=HASH(DATA SET BID, SN1,SN4).

As illustrated, TXN8 218 h depends on the data set from TXN7 218 g asshown by transform operation 226 d. The security node hash identifier222 f for this transaction is illustrated as (SN3′). The security nodehash generator 220, in one example, is implemented as one or moreprocessors that execute instructions that are stored in a non-transitorystorage medium such that when the one or more processors executes thecode, the one or more processors perform the operations describedherein. Also, in this example, the cryptographic hash engine 224performs in one example a one-way hash operation, although any suitablehash operation may be employed. In one implementation, the one-way hashoperation uses an SHA-256 hash function. The data sets corresponding tothe various data resource identifiers in one example are stored in theresource database 116, however any suitable storage structure may beemployed.

FIG. 3 is a flowchart illustrating a method 300 for providingnetwork-based permissioning for a data resource platform according toone embodiment of the present disclosure. This diagram is merely anexample, which should not unduly limit the scope of the claims. One ofordinary skill in the art would recognize many variations, alternatives,and modifications. In some examples, the method is performed by thenetwork-based permissioning system 104. As shown in block 302, themethod includes generating a security node hash identifier, such assecurity node hash identifier 222 a by performing a hash operation on adata resource identifier, such as DATA SET A ID, associated with a dataresource produced by the data resource platform. For example, a dataresource, such as a data set as produced by the data processing platform102 has a resource identifier associated therewith, such as dataresource identifier 210. The cryptographic hash engine 224 performs, inone example, a one-way hash operation on the data resource identifier210, DATA SET A ID, resulting in a security node hash identifier 222 a(SN1) for a raw data set. As shown in block 304, the method includesgenerating a dependent second security node hash identifier, such assecurity node hash identifier 222 b (SN2) by performing a hash operationon a data resource identifier 212, DATA SET B ID, as associated with adependent second data resource, in this case a data set that dependsfrom the data set from the parent container 202. In one example, thesecurity node hash identifier 222 b is generated by performing a hashoperation on the concatenation of the data resource identifier 212 andon the security node hash identifier 222 a (SN1). The dependent seconddata resource such as a data set identified by DATA SET B ID, isproduced by the data resource platform through any suitabletransformation using the data resource, in this example, a parent dataset identified by DATA SET A ID in parent container 202.

As shown in block 306, the method includes receiving an access requestsuch as a user access request, for access to the dependent data source,namely the data set identified by DATA SET B ID, in this example. Theaccess request may be received by the network-based permission systemthrough any suitable mechanism including one or more applicationsrequesting access to the dependent data resource or in any othersuitable manner. As shown in block 308, the method includes grantingpermission to access the dependent data resource to a user based atleast in part on the dependent second security node hash identifier 222b SN2. For example, although the data set associated with DATA SET B IDis dependent on DATA SET A ID, the network-based permissioning systemdoes not need to evaluate policies associated with DATA SET A ID andinstead the hash operation serves as a type of automatic linking ofprior security policies that were associated with DATA SET A ID. Forexample, in one example, because a user has permission to access rawdata sets, any dependencies from those data sets will have the samepolicy as represented by the hash value of previous security node hashIDs.

In some examples, the network-based permissioning system 104 inserts adata structure in memory such as the resource database 116, thatincludes a hierarchical resource graph that includes nodes identified bythe security node hash identifiers and dependent security node hashidentifiers associated with the dependent second set. In someimplementations, the network-based permissioning system stores thesecurity node hash identifiers SN1, SN2, SN3, SN3′, SN4, SN2′ in ahierarchical format.

In certain implementations, each security node hash identifier has asecurity policy associated therewith. In one example, the securitypolicy is stored in a lookup table such that each security node hashidentifier has one or more corresponding policies linked thereto. In oneimplementation, the data resource identifiers are data set identifierswherein some of the data set identifiers identify dependent data sets.For example, DATA SET B ID is dependent on DATA SET A ID whereas DATASET C ID is dependent on DATA SET B ID and DATA SET D ID is a raw dataset as is DATA SET A ID 210. When a security node hash identifier isgenerated, a security policy is also associated therewith to, forexample, linking through a lookup table, or any other suitablemechanism. In one example, the policy of the parent is propagated byvirtue of the hash operation to dependent nodes.

In the example where a data set is derived from multiple parent dataresources, such as the example where TXN7 218 g is dependent on DATA SETD ID which is a parent data set as well as being dependent on DATA SET AID, the security hash identifier 222 e (51\12′) is generated byperforming a hash operation on a parent data resource ID such as DATASET D ID to generate security node hash identifier 222 d (SN4). Themethod also includes generating a dependent security node hashidentifier by performing a hash operation on the data resourceidentifier, namely DATA SET B ID, the security node hash identifier 222a (SN1) and the security node hash identifier 222 d (SN4). This is shownby security node hash identifier 222 e (SN2′).

In some implementations, each security node hash identifier has anassociated security policy. In some implementations, the security policyfrom the parent data set is inherited by the dependent data set so thata single lookup using the security node hash identifier in a lookuptable points to the security policy of the parent. In otherimplementations, a lookup table is populated by the network-basedpermissioning system such that each security node hash identifier has acorresponding policy (see for example, FIG. 4 ).

In some implementations, where two levels of dependencies occur, aone-way hash operation is performed on a data set identifier thatuniquely identifies another dependent data set and on a security nodehash identifier. The security policy that is associated with thesecurity node hash identifier, in some implementations, is the samesecurity policy from the security node from which it directly depends.Referring again to FIG. 2 , where the DATA SET C ID depends on DATA SETB ID which depends on DATA SET A ID, the security node hash identifier222 c (SN3) is generated by taking the hash of the concatenation of theDATA SET C ID and the security node hash identifier 222 b (SN2). It willbe recognized that any suitable number of dependencies may be employed.

In some implementations, for a new data set that is created, such as aparent data set or dependent data set, the method includes generating asecurity node hash identifier associated with the new data set byperforming a cryptographic one-way hash operation on a concatenation ofa data set identifier assigned to the new data set and security nodehash identifiers of all directly dependent security node hashidentifiers corresponding to data sets upon which the new data setdirectly depends. Although the above has been shown using a selectedgroup of processes for the method, there can be many alternatives,modifications, and variations. For example, some of the processes may beexpanded and/or combined. Other processes may be inserted into thosenoted above. Depending upon the embodiment, the sequence of processesmay be interchanged with others replaced. Although the above has beenshown using a selected group of processes for the method, there can bemany alternatives, modifications and variations. For example, some ofthe processes may be expanded and/or combined. Other processes may beinserted in to those noted above. Depending upon the embodiment, thesequence of processes may be interchanged with others replaced.

In some embodiments, some or all processes (e.g., steps) of the method300 are performed by the network-based permissioning system 104. Incertain examples, some or all processes (e.g., steps) of the method 300are performed by a computer and/or a processor directed by a code. Forexample, a computer includes a server computer and/or a client computer(e.g., a personal computer). In some examples, some or all processes(e.g., steps) of the method 300 are performed according to instructionsincluded by a non-transitory computer-readable medium (e.g., in acomputer program product, such as a computer-readable flash drive). Forexample, a non-transitory computer-readable medium is readable by acomputer including a server computer and/or a client computer (e.g., apersonal computer, and/or a server rack). As an example, instructionsincluded by a non-transitory computer-readable medium are executed by aprocessor including a processor of a server computer and/or a processorof a client computer (e.g., a personal computer, and/or server rack).

FIG. 4 illustrates one example of the permissioning system 104 andresource database 116 that includes one or more lookup tables that areemployed to determine whether to grant user permission in response to apermission access request. As previously noted, the security node hashgenerator 220 generates the security node hash identifiers 222 a-222 fand stores them or indexes to them as entries in memory, such asresource database 116. In one example, the security node hashidentifiers are inserted into lookup tables 400 and 402. For example,the security node hash generator 220, or other component, stores inlookup table 400 a link between each transaction 218 a-218 h andcorresponding security node hash identifiers 222 a-222 f It will berecognized however that any suitable linking mechanism may be employedand that other linking mechanisms other than, for example, thetransaction identifiers may be used to index security node hashidentifiers for particular data sets or containers. When a transactionlevel lookup is desired, the evaluation module looks up the transactionin the lookup table 400 and finds the corresponding security node hashidentifier then uses lookup table 402 to find the corresponding policyfor the security node hash identifier.

In certain implementations, lookup table 402 includes table entries thathave data representing security node hash identifiers 222 a-222 f, inthis example. Each of the security node hash identifiers 222 a-222 f arelinked to corresponding policies 404 a-404 f (although only 404 a and404 b are shown). The network-based permissioning system stores, in oneexample, for each security node hash identifier, a correspondingsecurity policy that includes data representing user identifiers ofusers permissioned to perform one or more operations on the data set,approve dependency conditions with other data sets and one or more groupidentifiers to which a user belongs. However, it will be recognized thatthe lookup tables 400 and 402 can be configured as one or more tables,or any other suitable format as desired. As used herein a policy mayinclude data representing one or more policies and that an index to oneor more policies may be employed. In this example, each policy includesdata representing a user ID and in some examples group identifiers aswell as dependent conditions that must be met in order to grantpermission. In some examples, the network-based permission system storesfor each security node hash identifier, a corresponding security policythat includes data 405 representing user identifiers of userspermissioned to perform one or more operations on the data set, approvedoperations, approved dependency conditions with other data sets and oneor more group identifiers to which a user belongs. In certain examples,the network-based permission system creates new security node hashidentifiers when inputs to a prior data set change.

In some implementations, a policy may be implemented as one or moreconditions. In some implementations a policy can be implemented as apolicy object or other structure that can include a set of ordered orunordered statements. A statement can include an action, condition andoperation. An action can define the behavior associated with astatement. The condition is used to determine application of the actionto the operation. The operation is the operation affected by thestatement. The action, for example, may specify that the user is eitherallowed or denied performing the operation based on whether thecondition is satisfied. Conditions that may be allowed can includereading, writing or viewing operations associated with a data set. Anyother suitable conditions may also be employed. Any other suitableformat for policy objects may also be employed. In one example, a policyfor a dependent security node hash identifier is inherited from theparent regardless of the number of dependencies. Where there aredependencies from multiple parents, an administrator can be asked tochoose the appropriate policy that should be associated with a givensecurity node hash identifier. Other conflict resolution mechanisms mayalso be employed.

In certain implementations, the network-based permissioning system 104includes an evaluation module 406 that evaluates an access request 408and returns a reply 410 granting or denying requested permission to therequested resource. The evaluation module 406 like the security nodehash generator 220 in one example is implemented as one or moreprocessors executing stored instructions that are stored in memory thatwhen executed, causes the one or more processors to operate as describedherein. Permission is granted to a user by comparing a received securitynode hash from the access request, to the stored security node hashidentifiers in the lookup tables 400 and 402. As such, the evaluationmodule 406 serves as a type of comparator to compare incoming accessrequest information to stored security node hash identifier and policyinformation.

In some implementations, a user access request 408 is received by thenetwork-based permissioning system such that an access request includesa requesting user identifier such as a unique user ID or other suitableuser identifier, a dependent security node hash identifier and arequested permission condition. In one example, a has_Operation requestis provided to the evaluation module 406. The has_Operation requestincludes a user ID, a security node hash identifier corresponding to thedata resource that the user wishes to access and a requested operation.For example, each user has a unique identifier, the security node hashidentifier may correspond to 222 b (SN2) corresponding to data setassociated with DATA SET B ID and the operation that the user wishes toperform on the data set may be a read, write, view or other operation.

In certain implementations, to evaluate the requesting user's accesspermission for a particular data resource, the evaluation module 406performs a lookup operation in lookup table 402. In someimplementations, the evaluation module 406 searches the lookup table 402for a security node hash identifier that matches the security node hashidentifier in the access request. If not found, the evaluation modulereturns a negative or “false” reply 410 denying permission to the accessrequest 408. However, if the security node hash identifier that isreceived in the access request 408 matches a security node hashidentifier in the lookup table 402, the evaluation module looks to seeif the received user ID in the access request matches the stored user IDassociated with the policy for the corresponding security node hashidentifier. If the user ID matches, the evaluation module determines ifthe requested operation in the access request matches an allowableoperation for the particular user according to the policy. If theoperation that is requested matches an approved operation, theevaluation module issues a positive or “true” reply 410 to the accessrequest 408 and the user is granted access to the requested dataresource and is allowed to perform the requested operation. However, ifthe requested operation does not match the stored operationcorresponding to the policy, then the access request is denied. In otherimplementations, the evaluation module searches on a transaction levelfirst using the lookup table 400 to locate the appropriate security nodehash identifier in lookup table 402.

FIG. 5 is a block diagram illustrating one example of a method 500 forproviding network-based permissioning for a data resource platformcarried out by the permissioning system 104. This diagram is merely anexample, which should not unduly limit the scope of the claims. One ofordinary skill in the art would recognize many variations, alternatives,and modifications. As shown in block 502, the method includes generatinga security node hash identifier associated with one or more transactionsassociated with a data set identifier. As previously described, in oneexample, the security node hash generator 220 generates the varioussecurity node hash identifiers as the transactions are being completedor as the data sets are being generated. In other embodiments, thesecurity node hash identifiers are generated in batch operations. Asshown in block 504, the method includes storing a table such as lookuptable 400 having entries identifying transaction identifiers andcorresponding security node hash identifiers. In one example, the lookuptable 402 is used to determine permissions based on transactionidentifiers. As shown in block 506, the method includes storing tableentries such as those in lookup table 400 that include data representingsecurity node hash identifiers and corresponding policies wherein thepolicies include user identifiers, group identifiers and operations thatare permitted for a particular user, including dependent conditions.

As shown in block 508, the method includes receiving an access requestfor access to a dependent data resource. As shown in block 510, themethod includes granting permission to the user to access the dependentdata resource based on the user ID, security node hash ID and arequested permission operation from the access request, when the tableentries for the user ID, the security node hash ID and policy matchthose from the access request. Although the above has been shown using aselected group of processes for the method, there can be manyalternatives, modifications, and variations. For example, some of theprocesses may be expanded and/or combined. Other processes may beinserted into those noted above. Depending upon the embodiment, thesequence of processes may be interchanged with others replaced. Althoughthe above has been shown using a selected group of processes for themethod, there can be many alternatives, modifications and variations.For example, some of the processes may be expanded and/or combined.Other processes may be inserted in to those noted above. Depending uponthe embodiment, the sequence of processes may be interchanged withothers replaced.

In some embodiments, some or all processes (e.g., steps) of the method500 are performed by the network-based permissioning system 104. Incertain examples, some or all processes (e.g., steps) of the method 500are performed by a computer and/or a processor directed by a code. Forexample, a computer includes a server computer and/or a client computer(e.g., a personal computer). In some examples, some or all processes(e.g., steps) of the method 500 are performed according to instructionsincluded by a non-transitory computer-readable medium (e.g., in acomputer program product, such as a computer-readable flash drive). Forexample, a non-transitory computer-readable medium is readable by acomputer including a server computer and/or a client computer (e.g., apersonal computer, and/or a server rack). As an example, instructionsincluded by a non-transitory computer-readable medium are executed by aprocessor including a processor of a server computer and/or a processorof a client computer (e.g., a personal computer, and/or server rack).

FIG. 6 is a simplified diagram showing a computing system forimplementing a network-based permissioning system according to oneembodiment of the present disclosure. This diagram is merely an example,which should not unduly limit the scope of the claims. One of ordinaryskill in the art would recognize many variations, alternatives, andmodifications. The computing system 600 includes a bus 602 or othercommunication mechanism for communicating information, a processor 604,a display 606, a cursor control component 608, an input device 610, amain memory 612, a read only memory (ROM) 614, a storage unit 616, and anetwork interface 618. In some embodiments, some or all processes (e.g.,steps) of the method 300 and/or the method 500, are performed by thecomputing system 600. In some examples, the bus 602 is coupled to theprocessor 604, the display 606, the cursor control component 607, theinput device 610, the main memory 612, the read only memory (ROM) 614,the storage unit 616, and/or the network interface 618. In certainexamples, the network interface is coupled to a network 112. Forexample, the processor 604 includes one or more general purposemicroprocessors. In some examples, the main memory 612 (e.g., randomaccess memory (RAM), cache and/or other dynamic storage devices) isconfigured to store information and instructions to be executed by theprocessor 604. In certain examples, the main memory 612 is configured tostore temporary variables or other intermediate information duringexecution of instructions to be executed by processor 604. For examples,the instructions, when stored in the storage unit 616 accessible toprocessor 604, render the computing system 600 into a special-purposemachine that is customized to perform the operations specified in theinstructions. In some examples, the ROM 614 is configured to storestatic information and instructions for the processor 604. In certainexamples, the storage unit 616 (e.g., a magnetic disk, optical disk, orflash drive) is configured to store information and instructions.

In some embodiments, the display 606 (e.g., a cathode ray tube (CRT), anLCD display, or a touch screen) is configured to display information toa user of the computing system 600. In some examples, the input device610 (e.g., alphanumeric and other keys) is configured to communicateinformation and commands to the processor 604. For example, the cursorcontrol 608 (e.g., a mouse, a trackball, or cursor direction keys) isconfigured to communicate additional information and commands (e.g., tocontrol cursor movements on the display 606) to the processor 604.

According to certain embodiments, a method for providing network-basedpermissioning for a data resource platform includes generating a firstsecurity node hash identifier by performing a first hash operation on atleast a first data resource identifier associated with a first dataresource produced by the data resource platform, generating a dependentsecond security node hash identifier by performing a second hashoperation on a second data resource identifier associated with adependent second data resource and on at least the first security nodehash identifier, the dependent second data resource being produced bythe data resource platform using at least the first data resource as atleast one parent data resource, receiving an access request for accessto the dependent second data resource and in response to the accessrequest, granting permission to access the dependent second dataresource to a user associated with the access request based at least inpart on the dependent second security node hash identifier wherein themethod is performed by one or more processors. For example, the methodis implemented according to at least FIG. 1 , FIG. 2 , FIG. 3 , FIG. 4 ,FIG. 5 and/or FIG. 6 .

In some examples, the method includes generating a third security nodehash identifier by performing a third hash operation on at least a thirddata resource identifier associated with a third data resource producedby the data resource platform, wherein the performing the second hashoperation on the second data resource identifier associated with thedependent second data resource and on at least the first security nodehash identifier includes performing the second hash operation on thesecond data resource identifier and on at least the first security nodehash identifier and the third security node hash identifier, thedependent second data resource being produced by the data resourceplatform using at least the first data resource and the third dataresource as at least two parent data resources.

In certain examples, the first data resource identifier is a first dataset identifier that uniquely identifies a first data set and whereingenerating the first security node hash identifier includes performing aone-way hash operation on at least the first data set identifier, thefirst security node hash identifier having a first security policyassociated therewith and wherein the second data resource identifier isa second data set identifier that uniquely identifies a dependent seconddata set and wherein generating the dependent second security node hashidentifier includes performing a one-way hash operation on the seconddata set identifier and on at least the first security node hashidentifier, the dependent second security node hash identifier having asecond security policy associated therewith and wherein grantingpermission to access the dependent second data resource to the user isbased at least in part on the second security policy.

In some examples, the access request includes receiving at least onerequesting user identifier, receiving at least the dependent secondsecurity node hash identifier and receiving at least one requestedpermission condition, wherein the granting permission includes using thedependent second security node hash identifier to obtain the secondsecurity policy, wherein the second security policy includes at leastone approved user identifier and at least one approved permissioncondition and granting permission to the user when the at least oneapproved user identifier matches the at least one requesting useridentifier and the at least one requested permission condition matchesthe at least one approved permission condition.

In certain examples, the method includes inserting a data structure inmemory, the date structure includes a hierarchical resource graph thatincludes nodes identified by the first security node hash identifier andthe dependent second security node hash identifier associated with thedependent second data set.

In some examples, the method includes generating and storing a thirddependent security node hash identifier associated with a dependentthird data set by performing a one-way hash operation on: a third dataset identifier that uniquely identifies the dependent third data set andon at least the second security node hash identifier, the dependentthird security node hash identifier having a third security policyassociated therewith, wherein the dependent third data set is producedby the data resource platform using at least the dependent second dataset.

In certain examples, the method includes generating for a new data setthat is created, a security node hash identifier associated with the newdata set by performing a cryptographic one-way hash operation on aconcatenation of a data set identifier assigned to the new data set andsecurity node hash identifiers of all directly dependent security nodehash identifiers corresponding to data sets upon which the new data setdirectly depends.

In some examples, the method includes storing the dependent secondsecurity node hash identifier as a linked element to the second securitypolicy and wherein the second security policy includes the firstsecurity policy and wherein the granting permission to access thedependent second data resource based at least in part on the secondsecurity policy comprises comparing a security node hash identifierassociated with the access request to the stored dependent security nodehash identifier.

According to certain implementations, a system for providingnetwork-based permissioning for a data resource platform includes one ormore processors of a machine, a first non-transitory machine-readablemedium storing executable instructions that when executed cause the oneor more processors to generate a first security node hash identifier byperforming a first hash operation on at least a first data resourceidentifier associated with a first data resource produced by the dataresource platform, generate a dependent second security node hashidentifier by performing a second hash operation on a second dataresource identifier associated with a dependent second data resource andon at least the first security node hash identifier, the dependentsecond data resource being produced by the data resource platform usingat least the first data resource as at least one parent data resource,receive an access request for access to the dependent second dataresource and in response to the access request, grant permission toaccess the dependent second data resource to a user associated with theaccess request, based at least in part on the dependent second securitynode hash identifier. For example, the method is implemented accordingto at least FIG. 1 , FIG. 2 , FIG. 3 , FIG. 4 , FIG. 5 and/or FIG. 6 .

In some examples, the first non-transitory machine-readable mediumstores executable instructions that when executed cause the one or moreprocessors to generate a third security node hash identifier byperforming a third hash operation on at least a third data resourceidentifier associated with a third data resource produced by the dataresource platform, wherein the performing the second hash operation onthe second data resource identifier associated with the dependent seconddata resource and on at least the first security node hash identifierincludes performing the second hash operation on the second dataresource identifier and on at least the first security node hashidentifier and the third security node hash identifier, the dependentsecond data resource being produced by the data resource platform usingat least the first data resource and the third data resource as at leasttwo parent data resources.

In certain examples, the first data resource identifier is a first dataset identifier that uniquely identifies a first data set, wherein thesecond data resource identifier is a second data set identifier thatuniquely identifies a dependent second data set and wherein the firstnon-transitory machine-readable medium stores executable instructionsthat when executed cause the one or more processors to generate thefirst security node hash identifier associated with at least the firstdata set identifier by performing a one-way hash operation on at leastthe first data set identifier, the first security node hash identifierhaving a first security policy associated therewith, generate thedependent second security node hash identifier by performing a one-wayhash operation on the second data set identifier that uniquelyidentifies the dependent second data set and on at least the firstsecurity node hash identifier, the dependent second security node hashidentifier having a second security policy associated therewith, andstore the first security node hash identifier and the dependent secondsecurity node hash identifier.

In some examples, the first non-transitory machine-readable mediumstores executable instructions that when executed cause the one or moreprocessors to receive the access request that includes at least onerequesting user identifier, at least the dependent second security nodehash identifier and at least one requested permission condition, grantthe permission operation by using the dependent second security nodehash identifier to obtain the second security policy, wherein the secondsecurity policy includes at least one approved user identifier and atleast one approved permission condition and grant the permissionoperation when the at least one approved user identifier matches the atleast one requesting user identifier and the at least one requestedpermission condition matches the at least one approved permissioncondition.

In certain examples, the first non-transitory machine-readable mediumstores executable instructions that when executed cause the one or moreprocessors to generate a third dependent security node hash identifierassociated with a dependent third data set, by performing a one-way hashoperation on: a third data set identifier that uniquely identifies thedependent third data set and on at least the second security node hashidentifier, the dependent third security node hash identifier having athird security policy associated therewith and store the third dependentsecurity node hash identifier, wherein the dependent third data set isproduced by the one or more processors using at least the dependentsecond data set.

In some examples, the system includes a second non-transitorymachine-readable medium and wherein the one or more processors storesthe first security node hash identifier and the dependent secondsecurity node hash identifier as part of a hierarchical resource graphthat includes data resource nodes.

According to certain implementations, a non-transitory machine-readablemedium includes executable instructions that when executed by one ormore processors cause the one or more processors to generate a firstsecurity node hash identifier by performing a first hash operation on atleast a first data resource identifier associated with a first dataresource produced by the data resource platform, generate a dependentsecond security node hash identifier by performing a second hashoperation on a second data resource identifier associated with adependent second data resource and on at least the first security nodehash identifier, the dependent second data resource being produced bythe data resource platform using at least the first data resource as atleast one parent data resource, receive an access request for access tothe dependent second data resource, and in response to the accessrequest, grant permission to access the dependent second data resourceto a user associated with the access request, based at least in part onthe dependent second security node hash identifier. For example, themethod is implemented according to at least FIG. 1 , FIG. 2 , FIG. 3 ,FIG. 4 , FIG. 5 and/or FIG. 6 .

In some examples, the non-transitory machine-readable medium includesexecutable instructions that when executed cause the one or moreprocessors to generate a third security node hash identifier byperforming a third hash operation on at least a third data resourceidentifier associated with a third data resource produced by the dataresource platform, wherein the performing the second hash operation onthe second data resource identifier associated with the dependent seconddata resource and on at least the first security node hash identifierincludes performing the second hash operation on the second dataresource identifier and on at least the first security node hashidentifier and the third security node hash identifier, the dependentsecond data resource being produced by the data resource platform usingat least the first data resource and the third data resource as at leasttwo parent data resources.

In certain examples, the first data resource identifier is a first dataset identifier that uniquely identifies a first data set, wherein thesecond data resource identifier is a second data set identifier thatuniquely identifies a dependent second data set and wherein thenon-transitory storage medium stores executable instructions that whenexecuted cause the one or more processors to generate the first securitynode hash identifier associated with at least the first data setidentifier by performing a one-way hash operation on at least the firstdata set identifier, the first security node hash identifier having afirst security policy associated therewith, generate the dependentsecond security node hash identifier by performing a one-way hashoperation on the second data set identifier that uniquely identifies thedependent second data set and on at least the first security node hashidentifier, the dependent second security node hash identifier having asecond security policy associated therewith and store the first securitynode hash identifier and the dependent second security node hashidentifier.

In some examples, the non-transitory machine-readable medium includesexecutable instructions that when executed cause the one or moreprocessors to receive the access request that includes at least onerequesting user identifier, at least the dependent second security nodehash identifier and at least one requested permission condition, grantthe permission operation by using the dependent second security nodehash identifier to obtain the second security policy, wherein the secondsecurity policy includes at least one approved user identifier and atleast one approved permission condition, and grant the permissionoperation when the at least one approved user identifier matches the atleast one requesting user identifier and the at least one requestedpermission condition matches the at least one approved permissioncondition.

In certain examples, the non-transitory machine-readable medium includesexecutable instructions that when executed cause the one or moreprocessors to generate a third dependent security node hash identifierassociated with a dependent third data set, by performing a one-way hashoperation on: a third data set identifier that uniquely identifies thedependent third data set and on at least the second security node hashidentifier, the dependent third security node hash identifier having athird security policy associated therewith and store the third dependentsecurity node hash identifier, wherein the dependent third data set isproduced by the one or more processors using at least the dependentsecond data set.

In some examples, the non-transitory machine-readable medium includesexecutable instructions that causes the one or more processors to storethe first security node hash identifier and the dependent secondsecurity node hash identifier as part of a hierarchical resource graphthat includes data resource nodes.

Additionally, the methods and systems described herein may beimplemented on many different types of processing devices by programcode comprising program instructions that are executable by the deviceprocessing subsystem. The software program instructions may includesource code, object code, machine code, or any other stored data that isoperable to cause a processing system to perform the methods andoperations described herein. Other implementations may also be used,however, such as firmware or even appropriately designed hardwareconfigured to perform the methods and systems described herein.

The systems' and methods' data (e.g., associations, mappings, datainput, data output, intermediate data results, final data results, etc.)may be stored and implemented in one or more different types ofcomputer-implemented data stores, such as different types of storagedevices and programming constructs (e.g., RAM, ROM, EEPROM, Flashmemory, flat files, databases, programming data structures, programmingvariables, IF-THEN (or similar type) statement constructs, applicationprogramming interface, etc.). It is noted that data structures describeformats for use in organizing and storing data in databases, programs,memory, or other computer-readable media for use by a computer program.

The systems and methods may be provided on many different types ofcomputer-readable media including computer storage mechanisms (e.g.,CD-ROM, diskette, RAM, flash memory, computer's hard drive, DVD, etc.)that contain instructions (e.g., software) for use in execution by aprocessor to perform the methods' operations and implement the systemsdescribed herein. The computer components, software modules, functions,data stores and data structures described herein may be connecteddirectly or indirectly to each other in order to allow the flow of dataneeded for their operations. It is also noted that a module or processorincludes a unit of code that performs a software operation and can beimplemented for example as a subroutine unit of code, or as a softwarefunction unit of code, or as an object (as in an object-orientedparadigm), or as an applet, or in a computer script language, or asanother type of computer code. The software components and/orfunctionality may be located on a single computer or distributed acrossmultiple computers depending upon the situation at hand.

The computing system can include client devices and servers. A clientdevice and server are generally remote from each other and typicallyinteract through a communication network. The relationship of clientdevice and server arises by virtue of computer programs running on therespective computers and having a client device-server relationship toeach other.

This specification contains many specifics for particular embodiments.Certain features that are described in this specification in the contextof separate embodiments can also be implemented in combination in asingle embodiment. Conversely, various features that are described inthe context of a single embodiment can also be implemented in multipleembodiments separately or in any suitable subcombination. Moreover,although features may be described above as acting in certaincombinations, one or more features from a combination can in some casesbe removed from the combination, and a combination may, for example, bedirected to a subcombination or variation of a subcombination.

Similarly, while operations are depicted in the drawings in a particularorder, this should not be understood as requiring that such operationsbe performed in the particular order shown or in sequential order, orthat all illustrated operations be performed, to achieve desirableresults. In certain circumstances, multitasking and parallel processingmay be advantageous. Moreover, the separation of various systemcomponents in the embodiments described above should not be understoodas requiring such separation in all embodiments, and it should beunderstood that the described program components and systems cangenerally be integrated together in a single software product orpackaged into multiple software products.

Although specific embodiments of the present invention have beendescribed, it will be understood by those of skill in the art that thereare other embodiments that are equivalent to the described embodiments.Accordingly, it is to be understood that the invention is not to belimited by the specific illustrated embodiments, but only by the scopeof the appended claims.

What is claimed is:
 1. A method for providing network-basedpermissioning for a data resource platform comprising: generating asecurity node hash identifier by performing a hash operation on at leasta data resource identifier associated with a data resource thatcomprises a data set produced by the data resource platform, the dataresource being associated with a security policy; storing, in a resourcedatabase, a data structure containing one or more entries that includeone or more security node hash identifiers and one or more securitypolicies corresponding to the one or more security node hashidentifiers, wherein the one or more security policies include one ormore approved user identifiers and one or more permitted operations forthe one or more approved user identifiers; receiving an access requestfor access to a dependent data resource associated with the dataresource, the access request comprising at least one security node hashidentifier, at least one requesting user identifier, and at least onerequest permission operation; and in response to the access request,granting permission to access the dependent data resource to a userassociated with the access request by at least: obtaining, from theresource database, at least one security node hash identifier, at leastone approved user identifier associated with the security node hashidentifier, and the one or more permitted operations for the approveduser identifier; and granting the permission to access the dependentdata resource in response to the at least one security node hashidentifier from the access request matching the at least one securitynode hash identifier obtained from the data structure; wherein themethod is performed by one or more processors.
 2. The method of claim 1,wherein the granting permission to access the dependent data resource tothe user associated with the access request includes: granting thepermission to access the dependent data resource in response to the atleast one requesting user identifier matching at least one of theapproved user identifiers, and the at least one request permissionoperation matching the one or more permitted operations for the approveduser identifier.
 3. The method of claim 1, wherein the data resourceidentifier includes one or more data set identifiers identifying one ormore dependent data sets associated with the dependent data resource. 4.The method of claim 1, wherein the data structure is a lookup table. 5.The method of claim 4, wherein the security policy is linked through thelookup table with the security node hash identifier corresponding to thesecurity policy.
 6. The method of claim 4, wherein the data set is aparent data set, the security node hash identifier is a parent securitynode hash identifier and the data resource is a parent data resource,wherein the method further comprises: generating a dependent securitynode hash identifier by performing a second hash operation on a seconddata resource identifier associated with the dependent data resource andbased on at least the parent security node hash identifier.
 7. Themethod of claim 6, wherein the security policy associated with theparent data set is inherited by a dependent data set such that a lookupusing the dependent security node hash identifier in the lookup tablepoints to the security policy associated with the parent data set. 8.The method of claim 7, wherein the lookup table is populated by anetwork-based permissioning system such that each security node hashidentifier in the lookup table has a corresponding security policy.
 9. Asystem for providing network-based permissioning for a data resourceplatform comprising: one or more processors; one or more memoriesstoring instructions that when executed, cause the one or moreprocessors to perform operations comprising: generating a security nodehash identifier by performing a hash operation on at least a dataresource identifier associated with a data resource that comprises adata set produced by the data resource platform, the data resource beingassociated with a security policy; storing a data structure containingone or more entries that include one or more security node hashidentifiers and one or more security policies corresponding to the oneor more security node hash identifiers, wherein the one or more securitypolicies include one or more approved user identifiers and one or morepermitted operations for the one or more approved user identifiers;receiving an access request for access to a dependent data resource, theaccess request comprising at least one security node hash identifier, atleast one requesting user identifier, and at least one requestpermission operation; and in response to the access request, grantingpermission to access the dependent data resource to a user associatedwith the access request by at least: obtaining at least one securitynode hash identifier, at least one approved user identifier associatedwith the security node hash identifier, and the one or more permittedoperations for the approved user identifier; and granting the permissionto access the dependent data resource in response to the at least onesecurity node hash identifier from the access request matching the atleast one security node hash identifier obtained from the datastructure.
 10. The system of claim 9, wherein the granting permission toaccess the dependent data resource to the user associated with theaccess request includes: granting the permission to access the dependentdata resource in response to the at least one requesting user identifiermatching at least one of the approved user identifiers, and the at leastone request permission operation matching the one or more permittedoperations for the approved user identifier.
 11. The system of claim 9,wherein the data resource identifier includes one or more data setidentifiers identifying one or more dependent data sets associated withthe dependent data resource.
 12. The system of claim 9, wherein the datastructure is a lookup table.
 13. The system of claim 12, wherein thesecurity policy is linked through the lookup table with the securitynode hash identifier corresponding to the security policy.
 14. Thesystem of claim 12, wherein the data set is a parent data set, thesecurity node hash identifier is a parent security node hash identifierand the data resource is a parent data resource, wherein the operationsfurther comprises: generating a dependent security node hash identifierby performing a second hash operation on a second data resourceidentifier associated with the dependent data resource and based on atleast the parent security node hash identifier.
 15. The system of claim14, wherein the security policy associated with the parent data set isinherited by a dependent data set such that a lookup using the dependentsecurity node hash identifier in the lookup table points to the securitypolicy associated with the parent data set.
 16. The system of claim 15,wherein the lookup table is populated by a network-based permissioningsystem such that each security node hash identifier in the lookup tablehas a corresponding security policy.
 17. A non-transitorymachine-readable medium comprising executable instructions that whenexecuted by one or more processors cause the one or more processors to:generate a security node hash identifier by performing a hash operationon at least a data resource identifier associated with a data resourcethat comprises a data set produced by a data resource platform, the dataresource being associated with a security policy; store a data structurecontaining one or more entries that include one or more security nodehash identifiers and one or more security policies corresponding to thesecurity node hash identifiers, wherein the security policies includeone or more approved user identifiers and one or more permittedoperations for the one or more approved user identifiers; receive anaccess request for access to a dependent data resource, the accessrequest comprising at least one security node hash identifier, at leastone requesting user identifier, and at least one request permissionoperation; and in response to the access request, grant permission toaccess the dependent data resource to a user associated with the accessrequest by at least: obtaining at least one security node hashidentifier, at least one approved user identifier associated with thesecurity node hash identifier, and the one or more permitted operationsfor the approved user identifier; and granting the permission to accessthe dependent data resource in response to the at least one securitynode hash identifier from the access request matching the at least onesecurity node hash identifier obtained from the data structure.
 18. Thenon-transitory machine-readable medium of claim 17, wherein theexecutable instructions, when executed by the one or more processors,further cause the one or more processors to: grant the permission toaccess the dependent data resource in response to the at least onerequesting user identifier matching at least one of the approved useridentifiers, and the at least one request permission operation matchingthe one or more permitted operations for the approved user identifier.19. The non-transitory machine-readable medium of claim 17, wherein thedata structure is a lookup table.
 20. The non-transitorymachine-readable medium of claim 19, wherein the security policy islinked through the lookup table with the security node hash identifiercorresponding to the security policy.
 21. The non-transitorymachine-readable medium of claim 19, wherein the data set is a parentdata set, the security node hash identifier is a parent security nodehash identifier and the data resource is a parent data resource, whereinthe executable instructions, when executed by the one or moreprocessors, further cause the one or more processors to: generate adependent security node hash identifier by performing a second hashoperation on a second data resource identifier associated with thedependent data resource and based on at least the parent security nodehash identifier.
 22. The non-transitory machine-readable medium of claim21, wherein the security policy associated with the parent data set isinherited by a dependent data set such that a lookup using the dependentsecurity node hash identifier in the lookup table points to the securitypolicy associated with the parent data set.
 23. The non-transitorymachine-readable medium of claim 22, wherein the lookup table ispopulated by a network-based permissioning system such that eachsecurity node hash identifier in the lookup table has a correspondingsecurity policy.